Decomposition characterizations of classes of 2-connected graphs
نویسندگان
چکیده
By applying the Tutte decomposition of 2{connected graphs into 3{block trees we provide unique structural characterizations of several classes of 2{connected graphs, including minimally 2{connected graphs, minimally 2{edge{connected graphs, critically 2{connected graphs, critically 2{edge{connected graphs, 3{edge{connected graphs, 2{connected cubic graphs and 3{connected cubic graphs. We also give a characterization of minimally 3-connected graphs.
منابع مشابه
Graphs that do not contain a cycle with a node that has at least two neighbors on it
We recall several known results about minimally 2-connected graphs, and show that they all follow from a decomposition theorem. Starting from an analogy with critically 2-connected graphs, we give structural characterizations of the classes of graphs that do not contain as a subgraph and as an induced subgraph, a cycle with a node that has at least two neighbors on the cycle. From these charact...
متن کاملDistinct edge geodetic decomposition in graphs
Let G=(V,E) be a simple connected graph of order p and size q. A decomposition of a graph G is a collection π of edge-disjoint subgraphs G_1,G_2,…,G_n of G such that every edge of G belongs to exactly one G_i,(1≤i ≤n). The decomposition 〖π={G〗_1,G_2,…,G_n} of a connected graph G is said to be a distinct edge geodetic decomposition if g_1 (G_i )≠g_1 (G_j ),(1≤i≠j≤n). The maximum cardinality of π...
متن کاملDecycling a Graph by the Removal of a Matching: Characterizations for Special Classes
A graph G is matching-decyclable if it has a matching M such that G−M is acyclic. Deciding whether G is matching-decyclable is an NPcomplete problem even if G is 2-connected, planar, and subcubic. In this work we present characterizations of matching-decyclability in the following classes: chordal graphs, split graphs, distance-hereditary graphs, cographs, and Hamiltonian subcubic graphs. All t...
متن کاملThe maximal total irregularity of some connected graphs
The total irregularity of a graph G is defined as 〖irr〗_t (G)=1/2 ∑_(u,v∈V(G))▒〖|d_u-d_v |〗, where d_u denotes the degree of a vertex u∈V(G). In this paper by using the Gini index, we obtain the ordering of the total irregularity index for some classes of connected graphs, with the same number of vertices.
متن کاملSplit decomposition and graph-labelled trees: characterizations and fully-dynamic algorithms for totally decomposable graphs
In this paper, we revisit the split decomposition of graphs and give new combinatorial and algorithmic results for the class of totally decomposable graphs, also known as the distance hereditary graphs, and for two non-trivial subclasses, namely the cographs and the 3-leaf power graphs. Precisely, we give strutural and incremental characterizations, leading to optimal fullydynamic recognition a...
متن کامل